Dynamic Multi-threshold Metering Schemes
نویسندگان
چکیده
A metering scheme is a method by which an audit agency is able to measure the interaction between clients and servers on the web during a certain number of time frames. Naor and Pinkas 7] considered metering schemes in which any server is able to construct a proof to be sent to the audit agency if and only if it has been visited by at least a number, say h, of clients in a given time frame. In their schemes the parameter h is xed and is the same for any server and any time frame. This is acceptable whenever there is a long-term relationship between the audit agency and the servers. In order to measure any number of visits in any granularity we introduce dynamic multi{ threshold metering schemes, which are metering schemes in which there is a threshold h t j associated to any server S j for any time frame t. We mainly focus on the eeciency of dynamic multi{threshold metering schemes, providing lower bounds on the size of the information distributed to clients and to servers (this is important otherwise the task of receiving and sending information would burden the clients, that are not interested in the metering process).
منابع مشابه
On Metering Schemes
In order to decide on advertisement fees for web servers, Naor and Pinkas introduced (threshold) metering schemes secure against coalitions of corrupt servers and clients. Several researchers have generalized the idea of Naor and Pinkas: first metering scheme with pricing and dynamic multi-threshold metering schemes have been proposed; later the solution has been extended to allow general acces...
متن کاملA Linear Algebraic Approach to Metering Schemes
A metering scheme is a method by which an audit agency is able to measure the interaction between servers and clients during a certain number of time frames. Naor and Pinkas 21] proposed metering schemes where any server is able to compute a proof, i.e., a value to be shown to the audit agency at the end of each time frame, if and only if it has been visited by a number of clients larger than o...
متن کاملApplying General Access Structure to Metering Schemes
In order to decide on advertisement fees for web servers, Naor and Pinkas [15] introduced metering schemes secure against coalition of corrupt servers and clients. In their schemes any server is able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number of clients. After that in series of papers Masucci et. al. [1–3, 13, 14] generaliz...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملSome Protocols Useful on the Internet from Threshold Signature Schemes
In a threshold signature scheme, a group of players shares some secret information in such a way that only those subsets with a minimum number of players can compute a valid signature. In this paper we propose methods to construct some computationally secure distributed protocols from threshold signature schemes. Namely, we construct metering schemes from threshold non-interactive signature sch...
متن کامل